منابع مشابه
Proximate point searching
In the 2D point searching problem, our goal is to preprocess n points P = {p1, . . . , pn} in the plane so that, for an online sequence of query points q1, . . . qm, we can quickly determine which (if any) of the elements of P are equal to each query point qi. This problem can be solved in O(log n) time by mapping the problem down to one dimension. We present a data structure that is optimized ...
متن کاملSearching Critical Values for Floating-Point Programs
Programs with floating-point computations are often derived from mathematical models or designed with the semantics of the real numbers in mind. However, for a given input, the computed path with floating-point numbers may significantly differ from the path corresponding to the same computation with real numbers. As a consequence, developers do not know whether the program can actually produce ...
متن کاملTitle : APPROXIMATION ALGORITHMS FOR POINT PATTERN MATCHING AND SEARCHING
Title : APPROXIMATION ALGORITHMS FOR POINT PATTERN MATCHING AND SEARCHING Minkyoung Cho, Doctor of Philosophy, 2010 Directed by: Professor David M. Mount Department of Computer Science Point pattern matching is a fundamental problem in computational geometry. For given a reference set and pattern set, the problem is to find a geometric transformation applied to the pattern set that minimizes so...
متن کاملAnalysis of approximate nearest neighbor searching with clustered point sets
Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these points into a data structure, so that given a query point, the nearest data point to the query point can be reported efficiently. Because data sets can be quite large, we are primarily interested in data structures that use only O...
متن کاملDiscrete Point Cloud Filtering And Searching Based On VGSO Algorithm
The massive point cloud data obtained through the computer vision is uneven in density together with a lot of noise and outliers, which will greatly reduce the point cloud search efficiency and affect the surface reconstruction. Based on that, this paper presents a filtering algorithm based on Voxel Grid Statistical Outlier (VGSO): Firstly, 3D voxel grid is created for the massive point cloud d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2004
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2004.01.005